Global and Strict Curve Tting Method
نویسندگان
چکیده
To nd a global and smooth curve tting, cubic B-Spline method and gathering-line methods are investigated. When segmenting and recognizing a contour curve of character shape, some global method is required. If we want to connect contour curves around a singular point like crossing points, merging separated contours together which lies apart crossing the singular point is necessary. For this purpose , cubic B-Spline method and new line-gathering method are investigated and proposed. The result is that cubic B-Spline method is rather too easy to bend. Easy to bend feature can cover singular point smoothly, so is not good to detect singular points. Gathering-line method is to represent the contour by overlapped line segments. By overlapping lines, arcs can be represented in natural way. Some investigations and experimental results are shown.
منابع مشابه
Efficient circular arc interpolation based on active tolerance control
In this paper, we present an ef®cient sub-optimal algorithm for ®tting smooth planar parametric curves by G 1 arc splines. To ®t a parametric curve by an arc spline within a prescribed tolerance, we ®rst sample a set of points and tangents on the curve adaptively as well as with enough density, so that an interpolation biarc spline curve can be with any desired high accuracy. Then, we construct...
متن کاملHighly Parallel Evolutionary Algorithms
This work describes massively parallel genetic algorithms as a means for solving diicult global optimization, symbolic expression inference and curve tting problems. Results are shown for hard test cases and the implications for computational physics problems are discussed. The approach, eminently parallel, is believed to be competitive with more familiar methodologies used by computational sci...
متن کاملCurve tting that minimizes the mean square of perpendicular distances from sample points
This paper presents a new method of curvetting to a set of noisy samples. In the case of tting a curved line (or a curved surface) to given sample points, it seems natural the curve is decided so as to minimize the mean square of perpendicular distances from the sample points. However it is di cult to get the optimal curve in the sense of this criterion. In this paper, the perpendicular distanc...
متن کاملFitting a woven-cloth model to a curved surface: mapping algorithms
The problem of tting a 2D broadcloth composite ply (modelled as a piece of deformable woven cloth) onto a 3D curved surface (modelled with a NURBS surface) is considered. \Fitting" means that a ply is deformed and applied to a surface so that it is everywhere in contact with the surface. A tting method is presented that incorporates a exible method for specifying initial conditions, and allows ...
متن کاملA Novel Bayesian Method for Fitting Parametric and Non-Parametric Models to Noisy Data
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done by considering each point on the model as a possible source for each data point. The paradigm also allows to solve problems which are not de ned in the classical MSE approach, such as tting a segment (as opposed to a l...
متن کامل